Tractable Reasoning Based on the Fuzzy EL++ Algorithm
نویسندگان
چکیده
Fuzzy Description Logics (f-DLs) are extensions of classic DLs that are capable of representing and reasoning about imprecise and vague knowledge. Though reasoning algorithms for very expressive fuzzy DLs have been explored, an open issue in the fuzzy DL community is the study of tractable systems. In this paper we introduce the fuzzy extension of EL, we provide its syntax and semantics together with a reasoning algorithm for the fuzzy concept subsumption problem, in which other problems related to fuzzy DLs can be reduced.
منابع مشابه
Classifying Fuzzy Subsumption in Fuzzy-EL+
Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extensions to expressive DLs have been proposed today and many reasoning algorithms exist there is still no scalable and efficient reasoning system reported, mainly due to inherited computational complexity from crisp DLs and the lack f...
متن کاملEfficient Query Answering over Fuzzy EL-OWL Based on Crisp Datalog Rewritable Fuzzy EL++
OWL EL is an extension of the tractable EL description logic. Despite their inference capabilities over TBoxes, DL reasoners have a high ABox reasoning complexity which may constitute a serious limitation in the Semantic Web where we rely mainly on query answering (i.e. instance checking). The subsomption algorithm used in fuzzy EL reduce instance checking into concept satisfiability. To allow ...
متن کاملA Tractable Paraconsistent Fuzzy Description Logic
In this paper, we introduce the tractable pf -EL logic, a paraconsistent version of the fuzzy logic f -EL. Within pf -EL, it is possible to tolerate contradictions under incomplete and vague knowledge. pf -EL extends the f -EL language with a paraconsistent negation in order to represent contradictions. This paraconsistent negation is defined under Belnap’s bilattices. It is important to observ...
متن کاملScale reasoning with fuzzy-EL ontologies based on MapReduce
Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy or vague knowledge. In this paper, we consider the problem of reasoning with fuzzy-EL, which is a fuzzy extension of EL+. We first identify the challenges and present revised completion classification rules for fuzzy-EL that can be handled by MapReduce programs. We then propose an algorithm for sc...
متن کاملReasoning with Fuzzy-EL+ Ontologies Using MapReduce
Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy knowledge. In this paper, we consider fuzzy-EL, which is a fuzzy extension of EL. We first present revised completion rules for fuzzy-EL that can be handled by MapReduce programs. We then propose an algorithm for scale reasoning with fuzzy-EL ontologies based on MapReduce.
متن کامل